Model Checking Semi-Continuous Time Models Using BDDs

Model Checking Semi-Continuous Time Models Using BDDs

The veri cation of timed systems is extremely important but also extremely di cult Several methods have been proposed to assist in this task including extensions to symbolic model checking One possible use of model checking to analyze timed systems is by modeling passage of time as the number of taken transitions and ap plying quantitative algorithms to determine the timing parameters of the sy...

Model Checking Semi � Continuous Time Models Using

The veri cation of timed systems is extremely important but also extremely di cult Several methods have been proposed to assist in this task including extensions to symbolic model checking One possible use of model checking to analyze timed systems is by modeling passage of time as the number of taken transitions and ap plying quantitative algorithms to determine the timing parameters of the sy...

Symbolic Model Checking without BDDs

Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stålmarck’s Method [16] or the Davis & Putnam Procedure [7], can replace BDDs. This new technique avoids the space blow up of BDDs, generates c...

Equivalence Checking Using Abstract BDDs

Abstract BDDs: A Technique for Using Abstraction in Model Checking

BDDs: A Technique for Using Abstraction in Model Checking Edmund Clarke, Somesh Jha, Yuan Lu, and Dong Wang Carnegie Mellon University, Pittsburgh, PA 15213, USA {emc,sjha,yuanlu,dongw}@cs.cmu.edu Abstract. We propose a new methodology for exploiting abstraction in the context of model-checking. Our new technique uses abstract BDDs as its underlying data structure. We show that this technique b...